Simpler Parameterized Algorithm for OCT
نویسندگان
چکیده
We give a simple and intuitive fixed parameter tractable algorithm for the Odd Cycle Transversal problem, running in time O(3 · k · |E| · |V |). Our algorithm is best viewed as a reinterpretation of the classical Iterative Compression algorithm for Odd Cycle Transversal by Reed, Smith and Vetta [8].
منابع مشابه
Fuzzy adaptive tracking control for a class of nonlinearly parameterized systems with unknown control directions
This paper addresses the problem of adaptive fuzzy tracking control for aclass of nonlinearly parameterized systems with unknown control directions.In this paper, the nonlinearly parameterized functions are lumped into the unknown continuous functionswhich can be approximated by using the fuzzy logic systems (FLS) in Mamdani type. Then, the Nussbaum-type function is used to de...
متن کاملADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM
In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...
متن کاملOn Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
TheOdd Cycle Transversal problem (oct) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of oct with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Od...
متن کاملObtaining a Bipartite Graph by Contracting Few Edges
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph G and an integer k, and the task is to determine whether we can obtain a bipartite graph from G by a sequence of at most k edge contractions. Our main result is an f(k) n time algorithm for Bipartite Contraction. Despite a strong resemblance between B...
متن کاملSubexponential Parameterized Odd Cycle Transversal on Planar Graphs
In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, and the objective is to determine whether there exists a vertex set O in G of size at most k such that G \ O is bipartite. Reed, Smith, and Vetta [Oper. Res. Lett., 2004] gave an algorithm for OCT with running time 3knO(1). Assuming the exponential time hypothesis of Impagliazzo, Paturi and Zane, t...
متن کامل